Given a $n*n$ symetric matrix $A$ of real numbers.
(a) Write a pseudo-code to determin its maximum value.
(b) How many minimum comparisons does one need to make in order to find the maximum value? Develop an exact formula in terms of $n$.
Question II:
Let the factorial function be defined as $F(n):=n!$ where $n$ is a non-negative integer. Also let's define the combinatorial function as $C(n,k):=\frac{n!}{k!(n-k)!}$ where $k<n$